A Circle Fitting-based Method for Computing Parameters of Circular Arc in Scanning Engineering Drawing
نویسندگان
چکیده
منابع مشابه
Fixed-Location Circular-Arc Drawing
In this paper we consider the problem of drawing a planar graph using circular-arcs as edges and given a one-to-one mapping between the vertices of the graph and a set of n points on the plane, where n is the number of vertices in the graph. If for every edge we have only two possible circular arcs, then there a simple reduction to 2SAT yields an O(n) algorithm to find out if a drawing with no ...
متن کاملA Fast Randomized Hough Transform for Circle/Circular Arc Recognition
The main drawbacks of the Hough transform (HT) are the heavy requirement of computation and storage. To improve the drawbacks of the HT, the randomized Hough transform (RHT) was proposed. But the RHT is not suitable for detecting the pattern with the complex image because the probability is too low. In this paper, we propose a fast randomized Hough transform for circle/circular arc detection. W...
متن کاملA New Method for Assessment of Engineering Drawing Answer Scripts Using Fuzzy Logic
Popular method for assessment of final exam answer scripts in university and among the engineering drawing answer scripts based on absolute true or false judgment and assigning a single number or letter to answer of each problem cannot be so fair. To obtain a fair assessment method, we considered “imagination”, “accuracy”, “drawing” and “innovation” that are objectives of engineering dra...
متن کاملMinimum Fill-In on Circle and Circular-Arc Graphs
We present two algorithms solving the minimum ll-in problem on circle graphs and on circular-arc graphs in time O(n 3).
متن کاملFixed-Location Circular Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in the plane. If for every edge we have only two possible circular arcs, then a simple reduction to 2SAT yields an O(n) algorithm to find out if a drawing with no crossings can be realized, where n is the number of vertice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2013
ISSN: 1812-5638
DOI: 10.3923/itj.2013.5853.5858